Business Process Mining Using Iterated Local Search
نویسندگان
چکیده
This paper introduces ILS Miner, a novel method for discovering process models from event logs using iterated local search. A comparison between ILS Miner, GLS Miner and HeuristicMiner is presented in this paper. GLS Miner was chosen because applies Guided Local Search for discovering process models from event logs, HeuristicMiner[10] being a legacy method in business process discovery. It is shown that ILS Miner can discover process models that correctly map to the event log. ILS Miner works with business processes represented as graphs, and the final discovered process is represented as a BPMN diagram.
منابع مشابه
Controller Placement in Software Defined Network using Iterated Local Search
Software defined network is a new computer network architecture who separates controller and data layer in network devices such as switches and routers. By the emerge of software defined networks, a class of location problems, called controller placement problem, has attracted much more research attention. The task in the problem is to simultaneously find optimal number and location of controll...
متن کاملEPQ model with depreciation cost and process quality cost as continuous functions of time
Extensive research has been devoted to economic production quantity (EPQ) problem. However, little atten-tion has been paid to problems where depreciation cost and process quality cost must be considered, simulta-neously. In this paper, we consider the economic production quantity model of minimizing the annual total cost subject to depreciation cost and process quality cost, where depreciation...
متن کاملSolving multi-objective team orienteering problem with time windows using adjustment iterated local search
One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملHeuristics for High-Utility Local Process Model Mining
Local Process Models (LPMs) describe structured fragments of process behavior occurring in the context of less structured business processes. In contrast to traditional support-based LPM discovery, which aims to generate a collection of process models that describe highly frequent behavior, High-Utility Local Process Model (HU-LPM) discovery aims to generate a collection of process models that ...
متن کامل